Critical Subgraphs of a Random Graph
نویسندگان
چکیده
We prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical. 1991 Mathematics Subject Classification: Primary 05C80; Secondary 05C15.
منابع مشابه
Connectivity threshold for random subgraphs of the Hamming graph
We study the connectivity of random subgraphs of the d-dimensional Hamming graph H(d, n), which is the Cartesian product of d complete graphs on n vertices. We sample the random subgraph with an i.i.d. Bernoulli bond percolation onH(d, n) with parameter p. We identify the window of the transition: when np−logn → −∞ the probability that the graph is connected goes to 0, while when np − logn → +∞...
متن کاملEfficient algorithms for finding critical subgraphs
This paper presents algorithms to find vertex-critical and edge-critical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the chromatic number of G. Computational experiments are reported on random and DIMACS benchmark graphs to compare the proposed algorithms, as well as to find lower bounds on the chromatic number of these graphs. We improve...
متن کاملDistribution of certain sparse spanning subgraphs in random graphs
We describe a general approach of determining the distribution of spanning subgraphs in the random graph G(n, p). In particular, we determine the distribution of spanning subgraphs of certain given degree sequences, which is a generalisation of the d-factors, of spanning trianglefree subgraphs, of (directed) Hamilton cycles and of spanning subgraphs that are isomorphic to a collection of vertex...
متن کاملThe Maximum Block Size of Critical Random Graphs
Let G(n, M) be the uniform random graph with n vertices and M edges. Let ℘n,M be the maximum block-size of G(n, M) or the maximum size of its maximal 2-connected induced subgraphs. We determine the expectation of ℘n,M near the critical point M = n/2. As n− 2M ≫ n, we find a constant c1 such that c1 = lim n→∞ (
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 6 شماره
صفحات -
تاریخ انتشار 1999